Finding (S,D)-Hypernetworks in F-Hypergraphs is Np-Hard
نویسندگان
چکیده
منابع مشابه
Finding MAPs for Belief Networks is NP-Hard
Given a probabilistic world model, an important problem is to find the maximum a-posteriori probability (MAP) instantiation of all the random variables given the evidence. Numerous researchers using such models employ some graph representation for the distributions, such as a Bayesian belief network. This representation simplifies the complexity of specifying the distributions from exponential ...
متن کاملFinding the smallest binarization of a CFG is NP-hard
Grammar binarization is the process and result of transforming a grammar to an equivalent form whose rules contain at most two symbols in their right-hand side. Binarization is used, explicitly or implicity, by a wide range of parsers for contextfree grammars and other grammatical formalisms. Non-trivial grammars can be binarized in multiple ways, but in order to optimize the parser’s computati...
متن کاملTrainyard is NP-hard
Recently, due to the widespread diffusion of smart-phones, mobile puzzle games have experienced a huge increase in their popularity. A successful puzzle has to be both captivating and challenging, and it has been suggested that this features are somehow related to their computational complexity [5]. Indeed, many puzzle games – such as Mah-Jongg, Sokoban, Candy Crush, and 2048, to name a few – a...
متن کاملFinding Approximate Solutions to NP-Hard Problems by Neural Networks is Hard
Finding approximate solutions to hard combinatorial optimization problems by neu-ral networks is a very attractive prospect. Many empirical studies have been done in the area. However, recent research about a neural network model indicates that for any NP-hard problem the existance of a polynomial size network that solves it implies that NP=co-NP, which is contrary to the well-known conjecture ...
متن کاملCandy Crush is NP-hard
We prove that playing Candy Crush to achieve a given score in a fixed number of swaps is NP-hard.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Science Research Network
سال: 2022
ISSN: ['1556-5068']
DOI: https://doi.org/10.2139/ssrn.4178917